Hypothesis Transformation and Semantic Variability Rules Used in Recognizing Textual Entailment
نویسندگان
چکیده
Based on the core approach of the tree edit distance algorithm, the system central module is designed to target the scope of TE – semantic variability. The main idea is to transform the hypothesis making use of extensive semantic knowledge from sources like DIRT, WordNet, Wikipedia, acronyms database. Additionally, we built a system to acquire the extra background knowledge needed and applied complex grammar rules for rephrasing in English.
منابع مشابه
Chinese Textual Entailment Recognition Based on Syntactic Tree Clipping
Textual entailment has been proposed as a unifying generic framework for modeling language variability and semantic inference in different Natural Language Processing (NLP) tasks. This paper presents a novel statistical method for recognizing Chinese textual entailment in which lexical, syntactic with semantic matching features are combined together. In order to solve the problems of syntactic ...
متن کاملRecognizing Textual Entailment Using Description Logic and Semantic Relatedness
Recognizing Textual Entailment using Description Logic and Semantic Relatedness Reda Siblini, Ph.D. Concordia University, 2014 Textual entailment (TE) is a relation that holds between two pieces of text where one reading the first piece can conclude that the second is most likely true. Accurate approaches for textual entailment can be beneficial to various natural language processing (NLP) appl...
متن کاملSemKer: Syntactic/Semantic Kernels for Recognizing Textual Entailment
In this paper we describe the SemKer system participating to the fifth Recognizing of Textual Entailment (RTE5) challenge. The major novelty with respect to the systems with which we participated to the previous challenges is the use of semantic knowledge based on Wikipedia. More specifically, we used it to enrich the similarity measure between pairs of text and hypothesis (i.e. the tree kernel...
متن کاملRecognizing Textual Entailment by Theorem Proving Approach
We present two original methods for recognizing textual inference. First, is a modified resolution method, used in theorem proving, such that some linguistic considerations are introduced in unification of two atoms. Some recent methods of transforming texts in logic forms are used. Second, is based on semantic relations in text, as presented in WordNet. Both methods provide comparable results.
متن کاملRecognizing Textual Entailment Is lexical similarity enough?
We describe the system we used at the PASCAL-2005 Recognizing Textual Entailment Challenge. Our method for recognizing entailment is based on calculating “directed” sentence similarity: checking the directed “semantic” word overlap between the text and the hypothesis. We use frequency-based term weighting in combination with two different lexical similarity measures. Although one version of the...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 2007